Opportunistic Memory
نویسنده
چکیده
In this paper, we present a model of oppor-tunistic planning that uses planning-time rear soning about the opportunities that might arise during plan execution. The model is composed of three parts: a planning-time mechanism that places blocked goals into memory for later activation, an understanding system that activates suspended goals as a by-product of parsing the world, and an execution-time process for evaluating opportunities and merging newly activated goals into the plan-ning/execution agenda. We discuss this model in terms of examples from TRUCKER, a route-scheduling system, and RUNNER, an errand planner. Current research in planning has taken a rather dramatic change in course in the past few years. The notion that a planner can exhaustively preplan for a set of goals prior to execution has been largely abandoned. In part, this change is the result of demonstrations that planning for conjunctive goals is undecidable [Chapman, 1987]. A more important factor has been the realization that the dual assumptions of traditional planning (a closed world and complete knowledge) are untenable in any but the simplest domains. The planning theories that have grown out of this shift in paradigm differ from earlier theories in that they attempt to integrate planning and execution into a single process. The most extreme example of this has been the idea of situated activity [Agre & Chapman, 1987], which argues that plan-like behavior rises out of reflexive responses to external cues rather than from the guidance of a declarative plan. Less extreme theories center around the notion that plans have to be refined and repaired at execution time. These theories include: • Alterman's Adaptive Planning [1985], in which execution-time problems are handled by moving between "semantically" similar plan steps. • Firby's RAPs [1987], which allow a hierarchical planner to select between alternative plans on the basis of bottom-up information obtained at execution time. • Georgeff and Lansky's Procedural Reasoning System [1987], in which changing goals and beliefs about the state of the world determine which plans are chosen to be put on the execution stack. • Hammond's Case-Based Planning [1989] and Sim-mon's and Davis' Generate, Test, and Debug [1987], both of which use causal explanations of execution-time failures to choose between a variety of repairs. Moderate or extreme, each of these theories argues that the world changes, and that a planner must respond to those changes. They define a class of planners which, for lack of a …
منابع مشابه
Opportunistic Scheduling Using Channel Memory in Markov-modeled Wireless Networks
The presence of multiple users in a network provides us with a valuable resource known as multiuser diversity. With information on the instantaneous states of the channels, multiuser diversity can be tapped by opportunistic multiuser scheduling. It is important that the channel state information is acquired in a cost-effective way so that the losses involved in this operation do not offset the ...
متن کاملOpportunistic Scheduling Using Channel Memory in Markov-modeled Wireless Networks
The presence of multiple users in a network provides us with a valuable resource known as multiuser diversity. With information on the instantaneous states of the channels, multiuser diversity can be tapped by opportunistic multiuser scheduling. It is important that the channel state information is acquired in a cost-effective way so that the losses involved in this operation does not offset th...
متن کاملOpportunistic Reasoning: A Design Perspective
An essential component of opportunistic behavior is opportunity recognition, the recognition of those conditions that facilitate the pursuit of some suspended goal. Opportunity recognition is a special case of situation assessment, the process of sizing up a novel situation. The ability to recognize opportunities for reinstating suspended problem contexts (one way in which goals manifest themse...
متن کاملExploiting Channel Memory for Joint Estimation and Scheduling in Downlink Networks
We address the problem of opportunistic multiuser scheduling in downlink networks with Markov-modeled outage channels. We consider the scenario in which the scheduler does not have full knowledge of the channel state information, but instead estimates the channel state information by exploiting the memory inherent in the Markov channels along with ARQ-styled feedback from the scheduled users. O...
متن کاملEnergy Savings on a Cloud-Based Opportunistic Infrastructure
In this paper, we address energy savings on a Cloud-based opportunistic infrastructure. The infrastructure implements opportunistic design concepts to provide basic services, such as virtual CPUs, RAM and Disk while profiting from unused capabilities of desktop computer laboratories in a non-intrusive way. We consider the problem of virtual machines consolidation on the opportunistic cloud comp...
متن کاملA Misleading Anamnesis: Learning To Suspect
Leishmaniasis represents a complex, globally widespread opportunistic infection ranging from the visceral form, also called kala-azar, to the mucocutaneous and cutaneous disease. It is endemic in the Mediterranian Basin, Leishmania infantum being demonstrated as the main causative agent of autochthonous cases in Sicily, Italy. The long-term use of systemic antipsoriatic agents, including biotec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989